Near-minimax complex approximation by four kinds of Chebyshev polynomial expansion
نویسندگان
چکیده
منابع مشابه
Minimax Polynomial Approximation
Some new methods for obtaining the minimax polynomial approximation of degree n to a continuous function are introduced, and applied to several simple functions. The amount of computation required is substantially reduced compared with that of previous methods.
متن کاملNear-Circularity of the Error Curve In Complex Chebyshev Approximation
Let f(z) be analytic on the unit disk, and let p*(z) be the best (Chebyshev) polynomial approximation to f(z) on the disk of degree at most n. It is observed that in typical problems the “error curve,” the image of the unit circle under (f p*)(z), often approximates to a startling degree a perfect circle with winding number n + 1. This phenomenon is approached by consideration of related proble...
متن کاملError of Truncated Chebyshev Series and Other Near Minimax Polynomial Approximations
It is well known that a near minimax polynomial approximation p is obtained by truncating the Chebyshev series of a function fafter n + 1 terms. It is shown that if /'E C' " + " [-1, I], then 1I.f-pII may be expressed in terms off' " ' I) in the same manner as the error of minimax approximation. The result is extended to other types of near minimax approximation.
متن کاملDistributed Signal Processing via Chebyshev Polynomial Approximation
Unions of graph multiplier operators are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators. The proposed method features approximations of the graph multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We...
متن کاملReal Polynomial Chebyshev Approximation by the Carathiodory - Fejir Method
A new method is presented for near-best approximation of a real function F on [-r, r] by a polynomial of degree m. The method is derived by transplanting the given problem to the unit disk, then applying the Carath6odory-Fej6r theorem. The resulting near-best approximation is constructed from the principal eigenvalue and eigenvector of a Hankel matrix of Chebyshev coefficients of F. It is well ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1993
ISSN: 0377-0427
DOI: 10.1016/0377-0427(93)90303-s